منابع مشابه
Clique percolation
Derényi, Palla and Vicsek introduced the following dependent percolation model, in the context of finding communities in networks. Starting with a random graph G generated by some rule, form an auxiliary graph G whose vertices are the k-cliques of G, in which two vertices are joined if the corresponding cliques share k − 1 vertices. They considered in particular the case where G = G(n, p), and ...
متن کاملClique percolation in random networks.
The notion of k-clique percolation in random graphs is introduced, where k is the size of the complete subgraphs whose large scale organizations are analytically and numerically investigated. For the Erdos-Rényi graph of N vertices we obtain that the percolation transition of k-cliques takes place when the probability of two vertices being connected by an edge reaches the threshold p(c) (k) = [...
متن کاملClique percolation in random graphs
As a generation of the classical percolation, clique percolation focuses on the connection of cliques in a graph, where the connection of two k cliques means that they share at least l<k vertices. In this paper we develop a theoretical approach to study clique percolation in Erdős-Rényi graphs, which gives not only the exact solutions of the critical point, but also the corresponding order para...
متن کاملk-clique Percolation and Clustering
We summarise recent results connected to the concept of k-clique percolation. This approach can be considered as a generalisation of edge percolation with a great potential as a community finding method in real-world graphs. We present a detailed study of the critical point for the appearance of a giant kclique percolation cluster in the Erdős–Rényi-graph. The observed transition is continuous ...
متن کاملSequential algorithm for fast clique percolation.
In complex network research clique percolation, introduced by Palla, Derényi, and Vicsek [Nature (London) 435, 814 (2005)], is a deterministic community detection method which allows for overlapping communities and is purely based on local topological properties of a network. Here we present a sequential clique percolation algorithm (SCP) to do fast community detection in weighted and unweighte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures and Algorithms
سال: 2009
ISSN: 1042-9832,1098-2418
DOI: 10.1002/rsa.20270